Asymptotic multipartite version of the Alon–Yuster theorem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Asymptotic Multipartite Kühn-Osthus Theorem

In this paper we prove an asymptotic multipartite version of a well-known theorem of Kühn and Osthus by establishing, for any graph H with chromatic number r, the asymptotic multipartite minimum degree threshold which ensures that a large r-partite graph G admits a perfect H-tiling. We also give the threshold for an H-tiling covering all but a linear number of vertices of G, in a multipartite a...

متن کامل

Approximate multipartite version of the Hajnal-Szemerédi theorem

Let q be a positive integer, and G be a q-partite simple graph on qn vertices, with n vertices in each vertex class. Let δ = k k+1 + λ, where k = q + 4dlog qe and λ is a positive real number. If each vertex of G is adjacent to at least δn vertices in each of the other vertex classes, q is bounded and n is large enough, then G has a Kq-factor.

متن کامل

An asymptotic version of a theorem of Knuth

If ud(N) is the number of permutations in the symmetric group S(N) with no decreasing subsequence of length d+ 1, then ud(N) ∼ (2π) 1−d 2 „ d−1

متن کامل

A More General Version of the Costa Theorem

In accordance with the Costa theorem, the interference which is independent of the channel input and known non-causally at the transmitter, does not affect the capacity of the Gaussian channel. In some applications, the known interference depends on the input and hence has some information. In this paper, we study the channel with input dependent interference and prove a capacity theorem that n...

متن کامل

A multipartite Hajnal-Szemerédi theorem

The celebrated Hajnal-Szemerédi theorem gives the precise minimum degree threshold that forces a graph to contain a perfect Kk-packing. Fischer’s conjecture states that the analogous result holds for all multipartite graphs except for those formed by a single construction. Recently, we deduced an approximate version of this conjecture from new results on perfect matchings in hypergraphs. In thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 2017

ISSN: 0095-8956

DOI: 10.1016/j.jctb.2017.05.004